A cross-intersection theorem for vector spaces based on semidefinite programming

Vector ultrametric spaces and a fixed point theorem for correspondences

In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.

Intersection Theorems for Vector Spaces

[ n] qni_ 1 = IT / i . t q O""i<, q -1 Since we always refer to the same K, we will write this simply as [7]. If A, Bare subspaces of V, A < B, then B/ A denotes the factor space of B by A. If An B = (O)-the zero-space, then AB / A is the canonical projection of B into V / A. Suppose 1 ~ k < nand !¥ = {Fl> .. . , Fm} is a family of distinct k-dimensional subspaces of V. For 0 ~ s ~ k, let !¥(s)...

vector ultrametric spaces and a fixed point theorem for correspondences

in this paper, vector ultrametric spaces are introduced and a fixed point theorem is given forcorrespondences. our main result generalizes a known theorem in ordinary ultrametric spaces.

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

A semidefinite programming approach to a cross-intersection problem with measures